On regular and random two-dimensional packing of crosses

نویسندگان

چکیده

Abstract Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features crystalline as well random, irregular two-dimensional (2D) packing structures known. The 2D crosses does not yet belong to category solved problems. We demonstrate experiments different aspect ratios (arm width length) which fractions actually achieved by random packing, and we compare them densest structures. determine local correlations orientations positions after ensembles randomly placed were compacted plane until they jam. Short-range orientational order is found over 2 3 cross lengths. Similarly, spatial distributions neighbors extend crosses. There no simple relation between geometries peaks correlation functions, but some can be traced typical configurations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Two Dimensional Packing

The paper considers packing of rectangles into an innnite bin. Similar to the Tetris game, the rectangles arrive from the top and, once placed, cannot be moved again. The rectangles are moved inside the bin to reach their place. For the case in which rotations are allowed, we design an algorithm whose performance ratio is constant. In contrast, if rotations are not allowed, we show that no algo...

متن کامل

Packing vertices and edges in random regular graphs

In this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial upper bounds on the maximal sizes of these sets. The lower bounds are proved by analysing a class of algorithms that return feasible solutions for...

متن کامل

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

Regular three-dimensional bubble clusters: shape, packing and growth-rate

We consider three-dimensional clusters of equal-volume bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for three-dimensional bubble clusters. We discuss the possible number of bubbles that can be packed around a central one: the “kissing problem”, here adapted to deformable ob...

متن کامل

Quantum transport on two-dimensional regular graphs

Abstract. We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem can be treated in a large measure analytically. Some of these results carry over to graphs which obey open boundary conditions (OBCs), such as cylind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Granular Matter

سال: 2021

ISSN: ['1434-5021', '1434-7636']

DOI: https://doi.org/10.1007/s10035-021-01190-7